Busy Period and Busy Cycle Distributions and Parameters for a Particular <i>M</i>/<i>G</i>/<img src=image/10.5923.j.ajms.20120202.03_001.gif></img>Queue System

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Busy Period in the Fluid

Consider a uid queue fed by N on/oo sources. It is assumed that the silence periods of the sources are exponentially distributed, whereas the activity periods are generally distributed. The innow rate of each source, when active, is at least as large as the outtow rate of the buuer. We make two contributions to the performance analysis of this model. Firstly, we determine the Laplace-Stieltjes ...

متن کامل

Error Analysis of the Mean Busy Period of a Queue

The error between the actual value of the mean busy periQ..d and the value estimaled by a common queueing tormula (D;:;: SOl (i-V)) is evaluated. tDenning's addre:'l!l: Department of Compu.ter Sciences, Purdue University, W. Lafayette, IN 41907 USA. KoweJk's addre:iS: FClchbcrcich Inrormatik, Univer:ritut Hamburg. RoUlerbllumschau9ce 07/09, 2000 Hamburg 10, West Gcrmuny.

متن کامل

The Quest for Busy Beavers

In this chapter we study the feasibility of using Turing Machines as a model for the evolution of computer programs. To assess this idea we select, as test problem, the Busy Beaver — a well-known theoretical problem of undisputed interest and difficulty proposed by Tibor Rado in 1962. We focus our research on representational issues and on the development of specific genetic operators, proposin...

متن کامل

Busy Beavers and Kolmogorov Complexity

The idea to find the “maximal number that can be named” can be traced back to Archimedes (see his Psammit [1]). From the viewpoint of computation theory the natural question is “which number can be described by at most n bits”? This question led to the definition of the so-called “busy beaver” numbers (introduced by T. Rado). In this note we consider different versions of the busy beaver-like n...

متن کامل

The busy period of a repairman attending a (n + 1) unit parallel system

L’accès aux archives de la revue « Revue française d’automatique, informatique, recherche opérationnelle. Recherche opérationnelle » implique l’accord avec les conditions générales d’utilisation (http://www.numdam.org/legal. php). Toute utilisation commerciale ou impression systématique est constitutive d’une infraction pénale. Toute copie ou impression de ce fichier doit contenir la présente m...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: American Journal of Mathematics and Statistics

سال: 2012

ISSN: 2162-948X

DOI: 10.5923/j.ajms.20120202.03